Computing the Minimum Cut and Maximum Flow of Undirected Graphs
نویسندگان
چکیده
This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs. The new algorithm is equivalent to just applying Ford and Fulkerson algorithm to the directed graph obtained from original graph but with two directed arcs for each edge in the graph, one in each way. We present a proof of correctness and experimental results.
منابع مشابه
Improved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given vertices in O(n log logn) time. Second, we show how to achieve the same O(n log logn) bound for the problem of computing maximum flows in undirected planar graphs...
متن کاملComputing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in an undirected planar EVC-network to the minimum edge-cut problem in another planar network with edge capacity only (EC-network), thus the minimum-cut or the maximum flow value can be computed in O(n log n) time. Based on this r...
متن کاملMinimum s-t cut in undirected planar graphs when the source and the sink are close
Consider the minimum s − t cut problem in an embedded undirected planar graph. Let p be the minimum number of faces that a curve from s to t passes through. If p = 1, that is, the vertices s and t are on the boundary of the same face, then the minimum cut can be found in O(n) time. For general planar graphs this cut can be found in O(n log n) time. We unify these results and give an O(n log p) ...
متن کاملPolynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs
In this paper we study the maximum two-flow problem in vertexand edge-capacitated undirected STI-planar graphs, that is, planar graphs where the vertices of each terminal pair arc on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the valu...
متن کاملCuts in Directed Planar Networks by Parallel C Omput at Ions
We reduce the exponent to 3 in the case when the network is embedded in the plane beforehand and to 4 otherwise. The reader is supposed to be familiar with graphs, planar graphs, multigraphs and so on (see [1]). We use the well-known method in a similar way as in [4] which consists in the fact that the problem of finding minimum cuts in a network can be reduced to the shortest path problem in i...
متن کامل